Properties of a job search problem on a partially observable Markov chain in a dynamic economy

نویسنده

  • Toru Nakai
چکیده

This paper observes a job search problem on a partially observable Markov chain, which can be considered as an extension of a job search in a dynamic economy in [1]. This problem is formulated as the state changes according to a partially observable Markov chain, i.e., the current state cannot be observed but there exists some information regarding what a present state is. All information about the unobservable state are summarized by the probability distributions on the state space, and we employ the Bayes' theorem as a learning procedure. The total positivity of order two, or simply TP2, is a fundamental property to investigate sequential decision problems, and it also plays an important role in the Bayesian learning procedure for a partially observable Markov process. By using this property, we consider some relationships among prior and posterior information, and the optimal policy. "We will also observe the probabilities to make a transition into each state after some additional transitions by employing the optimal policy. In the stock market, suppose that the states correspond to the business situation of one company and if there is a state designating the default, then the problem is what time the stocks are sold off before bankrupt, and the probability to become bankrupt will be also observed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Properties of Total Positivity and an Application to Job Search under Uncertainty

The total positivity of order two is a fundamental property to investigate the sequential decision problem, and it also plays an important role in the Bayesian learning procedure for a partially observable Markov process. For this process, we also deals with a job search, and observe the probability densities on the state space after some additional transitions by employing the optimal policy. ...

متن کامل

On the Impact of Uncertainty in Dynamic Job Search

The object of this paper is to investigate the impact of uncertainty in a dynamic j ob search model where the states of the economy follow a Markov chain and the cost of search does not only depend on the state but on the period. Especially, we explore whether or not increasing the uncertainty about the states of the economy, the wage distribution, the number of job offered at a time and other ...

متن کامل

A Partially Observable Markovian Maintenance Process with Continuous Cost Functions

In this paper a two-state Markovian maintenance process where the true state is unknown will be considered. The operating cost per period is a continuous random variable which depends on the state of the process. If investigation cost is incurred at the beginning of any period, the system wit I be returned to the "in-control" state instantaneously. This problem is solved using the average crite...

متن کامل

DPSCREEN: Dynamic Personalized Screening

Screening in Operations Research and Statistics • Partially Observable Markov Decision Process POMDP (Ayer et.al.) • Bayesian Optimal Design (Rizopoulos et.al.) • Pros: Principled search for optimal policies • Cons: Markov/Semi-Markov, Stationary Screening in Medical Literature • Stochastic simulation based (Frazie et.al. ) • Pros: No assumptions on disease models • Cons: Not personalized, Comp...

متن کامل

Stochastic Local Search for POMDP Controllers

The search for finite-state controllers for partially observable Markov decision processes (POMDPs) is often based on approaches like gradient ascent, attractive because of their relatively low computational cost. In this paper, we illustrate a basic problem with gradient-based methods applied to POMDPs, where the sequential nature of the decision problem is at issue, and propose a new stochast...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computers & Mathematics with Applications

دوره 51  شماره 

صفحات  -

تاریخ انتشار 2006